Decidable and Undecidable Problems about Quantum Automata
نویسندگان
چکیده
We study the following decision problem: is the language recognized by a quantum finite automaton empty or nonempty? We prove that this problem is decidable or undecidable depending on whether recognition is defined by strict or nonstrict thresholds. This result is in contrast with the corresponding situation for probabilistic finite automata, for which it is known that strict and nonstrict thresholds both lead to undecidable problems.
منابع مشابه
Quantum automata and algebraic groups
We show that several problems which are known to be undecidable for probabilistic automata become decidable for quantum finite automata. Our main tool is an algebraic result of independent interest: we give an algorithm which, given a finite number of invertible matrices, computes the Zariski closure of the group generated by these matrices.
متن کاملProbabilistic Automata on Finite Words: Decidable and Undecidable Problems
This paper tackles three algorithmic problems for probabilistic automata on finite words: the Emptiness Problem, the Isolation Problem and the Value 1 Problem. The Emptiness Problem asks, given some probability 0 ≤ λ ≤ 1, whether there exists a word accepted with probability greater than λ, and the Isolation Problem asks whether there exist words whose acceptance probability is arbitrarily clos...
متن کاملUndecidability and Finite Automata
Using a novel rewriting problem, we show that two natural decision problems about finite automata are undecidable (i.e., recursively unsolvable). In contrast, we also prove three related problems are decidable. We apply one result to prove the undecidability of a related problem about k-automatic sets of rational numbers.
متن کاملSome formal tools for analyzing quantum automata
Results in the area of compact monoids and groups are useful in the analysis of quantum automata (1qfa’s). In this paper: (1) We settle isolated cut point Rabin’s theorem in the context of compact monoids, and we prove a lower bound on the state complexity of 1qfa’s accepting regular languages. (2) We use a method pointed out by Blondel et al. [Decidable and undecidable problems about quantum a...
متن کاملWeighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata!
We consider weighted o-minimal hybrid systems, which extend classical o-minimal hybrid systems with cost functions. These cost functions are “observer variables” which increase while the system evolves but do not constrain the behaviour of the system. In this paper, we prove two main results: (i) optimal o-minimal hybrid games are decidable; (ii) the model-checking of WCTL, an extension of CTL ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Comput.
دوره 34 شماره
صفحات -
تاریخ انتشار 2005